About Euclidean Rings

نویسنده

  • PIERRE SAMUEL
چکیده

In this article all rings are commutative with unit, all modules are unitary. Given a ring A, its multiplicative group of units (i.e. invertible elements) is denoted by A*. The customary definition of a Euclidean ring is that it is a domain A together with a map F : A + N (the nonnegative integers) such that (1) I : p(a) for a, b E r3 (0); (2) given a, b E -‘-I, b m;’ 0, there exist q and Y in ‘4 such that a = bq + Y and dr) < v(b). The main interest of a Euclidean ring .4 is that it is principal: given any nonzero idea1 b in ,4. take a nonzero element b in b with the smallest possible value for p(b); then, for any n E b, (2) h s ows that a = bq $ r with Y = 0, whence b generates b. In this proof, (I) h as not been used, and any well-ordered set TV could replace N as the range of v. This has already been noticed by Th. lLIotzkin [7]. On the other hand the hypothesis that A is a domain does not seem to be essential. We therefore give the following definition:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Euclidean Algorithm

In this note a constructive criterion for the existence of a Euclidean algorithm within a given integral domain is derived, and from among the different possible Euclidean algorithms in an integral domain one is singled out. The same is done for "transfinite" Euclidean algorithms. The criterion obtained is applied to some special rings, in particular rings of quadratic integers. By an example i...

متن کامل

Convolutional Codes Over Rings

Elementary information about convolutional codes over finite fields is introduced, and various motivations for extension to convolutional codes over finite rings are discussed. The recent primary motivation is found to be for use over phase modulation signals. Such ring codes enjoy the special property of phase weight equal to phase distance equal to the squared Euclidean distance between phase...

متن کامل

Fast Modular Reduction over Euclidean Rings and Its Application to Universal Hash Functions

In this letter, we propose a fast modular reduction method over Euclidean rings, which is a generalization of Barrett’s reduction algorithm over the ring of integers. As an application, we construct new universal hash function families whose operations are modular arithmetic over a Euclidean ring, which can be any of three rings, the ring of integers, the ring of Gauss integers and the ring of ...

متن کامل

Manuscripta Mathematica a Quadratic Field Which Is Euclidean but Not Norm-euclidean

The classification of rings of algebraic integers which are Euclidean (not necessarily for the norm function) is a major unsolved problem. Assuming the Generalized Riemann Hypothesis, Weinberger [7] showed in 1973 that for algebraic number fields containing infinitely many units the ring of integers R is a Euclidean domain if and only if it is a principal ideal domain. Since there are principal...

متن کامل

Skew constacyclic codes over Galois rings

We generalize the construction of linear codes via skew polynomial rings by using Galois rings instead of finite fields as coefficients. The resulting non commutative rings are no longer left and right Euclidean. Codes that are principal ideals in quotient rings of skew polynomial rings by a two sided ideals are studied. As an application, skew constacyclic self-dual codes over GR(4) are constr...

متن کامل

Foundations of Euclidean Constructive Geometry

Euclidean geometry, as presented by Euclid, consists of straightedge-andcompass constructions and rigorous reasoning about the results of those constructions. A consideration of the relation of the Euclidean “constructions” to “constructive mathematics” leads to the development of a first-order theory ECG of “Euclidean Constructive Geometry”, which can serve as an axiomatization of Euclid rathe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003